//	ID : pallab81
// 	PROG : 908
// 	LANG : C++
// 	2011-09-10-20.05.41 Saturday
//
// 	"I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define tp pair< int, pair<int,int> >
#define mmk( x, y , z ) mk( x, mk( y, z ) )

inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}const int inf = (int)1e6+100;
int root[inf+10];
int rank[inf+10];

inline void _Set() {
    fo(i,0,inf) {
        root[i]=i;
        rank[i]=0;
    }
}
inline int _Find(int x) {
    if( x!= root[x] ) {
        root[x] = _Find( root[x] );
    }
    return root[x];
}
inline void _Union(int x, int y) {
    int px = _Find(x);
    int py = _Find(y);
    if( rank[px] > rank[py] ) {
        root[py] = px;
    } else {
        root[px] = py;
    }
    if( rank[px] == rank[py]) {
        rank[py]+=1;
    }
}

int N;
int K;
int M;
int ps;
string ss;
set< tp , less< tp >  > pq;
inline void Read(){
    int sx,sy,cc;
    ps=0;
    for(int i=0,j=N-1; i<j; ++i){
        scanf("%d %d %d",&sx, &sy, &cc);
        //pq.insert( mmk(cc, sx,sy) );
        ps+=cc;
    }
    CI(K);
    for(int i=0;i<K;++i){
        scanf("%d %d %d",&sx,&sy,&cc);
        pq.insert( mmk(cc, sx,sy) );
    }
    CI(M);
    for(int i=0;i<M;++i){
        scanf("%d %d %d",&sx,&sy,&cc);
        pq.insert( mmk(cc, sx,sy) );
    }
}
inline void Proc(){
    _Set();
    int nc=0;
    while(!pq.empty()){
        tp t = (*pq.begin());
        pq.erase(pq.begin());
        int c = t.f;
        int x = t.s.f;
        int y = t.s.s;
        if( _Find(x)!=_Find(y) ){
            nc+=c;
            _Union(x,y);
        }
    }
    cout<<ss<<ps<<"\n"<<nc<<"\n";
    ss="\n";
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in.txt","rt",stdin);
    #endif
    ss="";
    while( scanf("%d",&N)==1 ){
        Read();
        Proc();
    }

return 0;
}
